Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(b(b(x1))))) → a(a(b(b(b(a(a(x1)))))))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(b(b(x1))))) → a(a(b(b(b(a(a(x1)))))))

Q is empty.

Termination of the TRS R could be shown with a Match Bound [6,7] of 2. This implies Q-termination of R.
The following rules were used to construct the certificate:

b(a(a(b(b(x1))))) → a(a(b(b(b(a(a(x1)))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 6, 7, 5, 4, 8, 3, 12, 13, 11, 10, 14, 9, 18, 19, 17, 16, 20, 15, 24, 25, 23, 22, 26, 21, 30, 31, 29, 28, 32, 27, 36, 37, 35, 34, 38, 33

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges: